Church’s Thesis and Functional Programming
نویسنده
چکیده
ion λx.A In the last case λx. is a binder and free occurrences of x in A become bound . A term in which all variables are bound is said to be closed otherwise it is open. The motivating idea is that closed term represent functions. The intended meaning of AB is the application of function A to argument B while λx.A is the function which for input x returns A. Terms which are the same except for renaming of bound variables are not distinguished, thus λx.x and λy.y are the same, identity function. 3In his monograph Church defines two slightly differing calculi called λI and λK, of these λK is now regarded as canonical and is what we sketch here.
منابع مشابه
The Church Synthesis Problem with Metric
Church’s Problem asks for the construction of a procedure which, given a logical specification φ(I,O) between input strings I and output strings O, determines whether there exists an operator F that implements the specification in the sense that φ(I, F (I)) holds for all inputs I. Büchi and Landweber gave a procedure to solve Church’s problem for MSO specifications and operators computable by f...
متن کاملA Natural Axiomatization of Church’s Thesis
The Abstract State Machine Thesis asserts that every classical algorithm is behaviorally equivalent to an abstract state machine. This thesis has been shown to follow from three natural postulates about algorithmic computation. Here, we prove that augmenting those postulates with an additional requirement regarding basic operations implies Church’s Thesis, namely, that the only numeric function...
متن کاملChurch's thesis meets the N-body problem
“Church’s thesis” is at the foundation of computer science. We point out that with any particular set of physical laws, Church’s thesis need not merely be postulated, in fact it may be decidable. Trying to do so is valuable. In Newton’s laws of physics with point masses, we outline a proof that Church’s thesis is false; phsyics is unsimulable. But with certain more realistic laws of motion, inc...
متن کاملInteraction, Computability, and Church’s Thesis
This article formalizes the claim that interactive finite computing agents are more expressive than Turing machines. The impact of models of interaction on Church’s thesis and Godel’s incompleteness result is explored. The evolution from algorithmic to interactive models of computation in computer architecture, software engineering, and AI is considered in a final section.
متن کاملProof of Church's Thesis
¶2 · What is computable is anything that any Turing machine can compute, where the Turing machine was defined by Turing (1936). There are other definitions of computable, using for example Church’s λ-calculus, but all of them are mathematically equivalent. In any case, the term computable is defined with mathematical rigor. ¶3 · But, because what can be calculated was considered a vague notion,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004